#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5, R = 1e5;
int n, r[N + 5];
int Hash[R + 5];
int cnt = 0;

int main() {
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
    memset(Hash, 0, sizeof Hash);
    cin >> n;
    for(int i = 1; i <= n; i++) {
        cin >> r[i];
        Hash[r[i]]++;
    }
    for(int i = 1; i <= R; i++) {
        cnt = max(cnt, Hash[i]);
    }
    cout << cnt << endl;
    return 0;
}